Rapid memory buffer write storage system and method

ABSTRACT

Efficient and convenient storage systems and methods are presented. In one embodiment a storage system includes a host for processing information, a memory controller and a memory. The memory controller controls communication of the information between the host and the memory, wherein the memory controller routes data rapidly to a buffer of the memory without buffering in the memory controller. The memory stores the information. The memory includes a buffer for temporarily storing the data while corresponding address information is determined.

RELATED APPLICATIONS

This Application is a Continuation of and claims the benefit of andpriority to application Ser. No. 12/337,963 (Attorney Docket No.SPSN-AF2766) entitled RAPID MEMORY BUFFER WRITE STORAGE SYSTEM ANDMETHOD (filed Dec. 18, 2008), which is incorporated herein by reference.

TECHNICAL FIELD

This invention relates generally to a information storage systems andmethods and more particularly, to systems and methods for alteringinformation stored in a memory.

BACKGROUND OF THE INVENTION

Electronic systems and circuits have made a significant contributiontowards the advancement of modern society and are utilized in a numberof applications to achieve advantageous results. Electronic technologiessuch as digital computers, calculators, audio devices, video equipment,and telephone systems have facilitated increased productivity andreduced costs in analyzing and communicating data, ideas and trends inmost areas of business, science, education and entertainment.Frequently, the electronic systems designed to provide these resultsinclude memories. However, accessing memory resources in a fast andefficient manner can involve complicated protocols.

Numerous electronic devices include processors that operate by executingsoftware comprising a series of instructions for manipulating data inthe performance of useful tasks. The instructions and associated dataare typically stored in a memory. Memories usually consist of a locationfor storing information and a unique indicator or address. The utility adevice provides often depends upon the speed and efficiency at whichinstructions are executed. The ability to access a memory and transferinformation quickly and conveniently usually has a significant impact oninformation processing latency. In traditional systems such as shown inFIG. 1A, information is typically transferred from a host 10 to a buffer21 in a memory controller 20 while complete address information isdetermined and then the data and physical address information istransferred to a buffer 31 of memory 30. FIG. 1B and 1C are blockdiagrams of conventional data input command cycle sequences in whichcolumn and row address information is determined before the data istransferred to the buffer 31 in memory 30.

Traditional attempts at memory control are often very convoluted andcomplex. Such protocols also suffer from inefficiency and overhead inregards to latency and available bandwidth throughout the system, whichcan result in issues with scheduling due to unknown traffic patterns andlimited resources. Such latency problems can be experienced by a hostattempting to read or write information to the memory. There are anumber of applications (e.g., real time applications) where processingtime is critical and extended latency in retrieving or writinginformation to a memory can have detrimental impacts on performance anduser experience. For example, in real time applications extended latencycan cause jumpy presentations.

Information is typically written by a program operation that programs orwrites a particular memory cell or group of cells (e.g., page, block,etc.). The particular memory cell is typically assigned anidentification or address and the system utilizes the address intracking which cell is storing a particular piece of information.Conventional memory cells are typically configured in a memory arrayarranged in columns and rows. Traditional approaches can exacerbatelatency delays when determining the appropriated column and rowindication for an address.

SUMMARY OF THE INVENTION

Efficient and convenient storage systems and methods are presented. Inone embodiment a storage system includes a host for processinginformation, a memory controller and a memory. The memory controllercontrols communication of the information between the host and thememory, wherein the memory controller routes data rapidly to a buffer ofthe memory without buffering in the memory controller. The memory storesthe information. The memory includes a buffer for temporarily storingthe data while corresponding address information is determined.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and form a part ofthis specification, illustrate embodiments of the invention by way ofexample and not by way of limitation. The drawings referred to in thisspecification should be understood as not being drawn to scale except ifspecifically noted.

FIG. 1A is a block diagram of a conventional data flow in traditionalsystem.

FIG. 1B is a block diagram of a conventional random data input commandcycle sequence.

FIG. 1C is a block diagrams of conventional data input command cyclesequences in which address information for a plurality of rows isdetermined before the data is transferred to the buffer.

FIG. 2 is a block diagram of an exemplary memory system in accordancewith one embodiment of the present invention.

FIG. 3 is a flow chart of an exemplary memory alteration processutilizing a rapid memory buffer write in accordance with one embodimentof the present invention.

FIG. 4A is a block diagram of an exemplary rapid buffer program sequencemethod in accordance with one embodiment of the present invention.

FIG. 4B is a timing diagram in accordance with one embodiment of thepresent invention corresponding to the rapid buffer program sequencemethod.

FIG. 5A is a block diagram of an exemplary rapid buffer program sequencemethod utilizing a default column address in accordance with oneembodiment of the present invention.

FIG. 5B is an exemplary timing diagram in accordance with one embodimentof the present invention corresponding to the rapid buffer programsequence method utilizing a default column address.

FIG. 6 is a block diagram of an exemplary random data input commandcycle sequence in accordance with one embodiment of the presentinvention.

FIG. 7 is a block diagram of an exemplary random data input commandcycle sequence with a cache program in accordance with one embodiment ofthe present invention.

DETAILED DESCRIPTION

Reference will now be made in detail to the preferred embodiments of theinvention, examples of which are illustrated in the accompanyingdrawings. While the invention will be described in conjunction with thepreferred embodiments, it will be understood that they are not intendedto limit the invention to these embodiments. On the contrary, theinvention is intended to cover alternatives, modifications andequivalents, which may be included within the spirit and scope of theinvention as defined by the appended claims. Furthermore, in thefollowing detailed description of the present invention, numerousspecific details are set forth in order to provide a thoroughunderstanding of the present invention. However, it will be obvious toone ordinarily skilled in the art that the present invention may bepracticed without these specific details. In other instances, well knownmethods, procedures, components, and circuits have not been described indetail as not to unnecessarily obscure aspects of the current invention.

Some portions of the detailed descriptions which follow are presented interms of procedures, logic blocks, processing, and other symbolicrepresentations of operations on data bits within a computer memory.These descriptions and representations are the means generally used bythose skilled in data processing arts to effectively convey thesubstance of their work to others skilled in the art. A procedure, logicblock, process, etc., is here, and generally, conceived to be aself-consistent sequence of steps or instructions leading to a desiredresult. The steps include physical manipulations of physical quantities.Usually, though not necessarily, these quantities take the form ofelectrical, magnetic, optical, or quantum signals capable of beingstored, transferred, combined, compared, and otherwise manipulated in acomputer system. It has proven convenient at times, principally forreasons of common usage, to refer to these signals as bits, values,elements, symbols, characters, terms, numbers, or the like.

It should be borne in mind, however, that all of these and similar termsare associated with the appropriate physical quantities and are merelyconvenient labels applied to these quantities. Unless specificallystated otherwise as apparent from the following discussions, it isappreciated that throughout the present application, discussionsutilizing terms such as “processing”, “computing”, “calculating”,“determining”, “displaying” or the like, refer to the action andprocesses of a computer system, or similar processing device (e.g., anelectrical, optical, or quantum, computing device), that manipulates andtransforms data represented as physical (e.g., electronic) quantities.The terms refer to actions and processes of the processing devices thatmanipulate or transform physical quantities within a computer system'scomponent (e.g., registers, memories, other such information storage,transmission or display devices, etc.) into other data similarlyrepresented as physical quantities within other components.

FIG. 2 is a block diagram of a memory system 100 in accordance with oneembodiment of the present invention. Memory system 100 includes host110, memory controller 120, and memory 130. Host 110 is coupled tomemory controller 120, which is coupled to memory 130. In oneembodiment, memory 130 includes core memory array 131, memory logic 132and page buffer 133.

The components of memory system 100 cooperatively operate to storeinformation. Host 110 processes information. Memory controller 120controls communication of the information between host 110 and memory130. Memory 130 stores the information for host 110. In one exemplaryimplementation, core memory array 131 is an array of memory cells forstoring bits arranged in rows and columns. The rows can be associatedwith addresses configured to store a “word” of bits at a particularaddress. Memory logic 132 coordinates the operations within memory 130.In one embodiment the memory 130 is a NAND device.

In one embodiment, storing information in memory system 100 involveswriting and erasing information in core memory array 131. It isappreciated the present invention is readily adaptable to a variety ofwriting and erasing operations. The page buffer 133 temporarily storesdata to be forwarded to the core memory array 131. For example, memorysystem 100 can perform rapid memory buffer write operations.

In one embodiment, the memory system 100 performs a rapid memory bufferwrite operation with a reordered command cycle sequence. The memoryalteration includes one or more command cycles in which various writeoperations are performed. In one embodiment, the write operations in acommand cycle can include a command indication, data and some of theaddress information. For example, during a write operation the hostsystem sends the memory controller an indication to write data and alsosends an indication of a logical address associated with the data. Inone embodiment, during a rapid memory buffer write the memory controllerrapidly forwards the data to a buffer of a memory device (e.g., pagebuffer 133 of memory device 130, etc.) and is not stored in a buffer ofa memory controller (e.g., memory controller 120) while completecorresponding address information is determined. The memory controllercan rapidly forward just the data or can also rapidly forward someaddress information (e.g., column address information, etc.). The buffer(e.g., page buffer 133, etc.) of the memory device temporarily storesthe data until the remainder of the address information (e.g., rowaddress, etc.) is determined by the memory controller (e.g., memorycontroller 120, etc.). In one exemplary implementation, the informationcan also be temporarily stored in the page buffer for one or more randomdata input command cycles.

It is appreciated that the present invention facilitates efficient writeoperations. In many of the embodiments and exemplary implementationsdescribed herein, the terms, “rapid”, “rapidly”, “direct”, “directly”,“quickly”, “immediately”, etc. are utilized to convey the communicationof data to a memory device without being stored in a buffer of a memorycontroller while complete corresponding physical address information isdetermined. It is appreciated that utilization of the terms direct ordirectly to indicate information (e.g., data, a portion of addressinformation, etc.) is communicated to a memory device also encompassesimplementations in which the information flows through other components(e.g., memory controller, etc.). In one embodiment, the data receivedfrom the host can be “directly” forwarded to a buffer of the memory(e.g., memory device's data buffer, memory device's page buffer, etc.)“via” other components (e.g., a memory controller, etc.) and stored inthe buffer of the memory while the remaining portion of thecorresponding address information is determined.

FIG. 2 also illustrates one exemplary flow of data in memory system 100in accordance with one embodiment of the present invention. In oneembodiment, at least a portion of the address information (e.g., rowinformation, etc.) is determined after the data is stored in the bufferof the memory device, unlike a conventional approach in which the memorycontroller completely translates the logical block address (LBA) fromthe host system into a physical block address (PBA) of the memory deviceprior to initiating a program sequence to the memory device. In oneexemplary implementation, the present rapid memory buffer writeoperation utilizes the page buffer in the memory device as a temporarystorage until the row address value of the physical block address (PBA)is determined. Thus, the conventional buffer in the memory controller isnot required for storing data while the row address value of thephysical block address (PBA) is determined.

In one embodiment, when determining the physical block address (PBA),the memory controller determines both the target row and columnaddresses in the memory device. The determination is split into twophases since determining target row address information takes more timethan the target column address information. Splitting the determinationinto two phases facilitates communication of a portion of the addressinformation and data rapidly to the buffer of a memory device before theremaining portion of the address information is determined.

It is appreciated the present invention is readily adaptable toefficiently utilize characteristics of a memory column and rowconfiguration. In one exemplary implementation, each 2 KB row in amemory device contains four physical block address (PBA) regions(4×512B+spare). The starting column address for the four PBA regions canbe specified by the two least significant bits of the logical blockaddress (LBA) from the host. In this exemplary implementation, thecolumn address can be calculated directly and forwarded to the memorydevice while the target row address requires a much more significantamount of calculation time. The column address information can also bedirectly forwarded if the load buffer command default to column addresszero in the page buffer. It is appreciated that the present invention isreadily adaptable to a variety of sequence orders that are differentfrom conventional approaches.

FIG. 3 is a flow chart of exemplary memory alteration process 300 inaccordance with one embodiment of the present invention. In oneembodiment, memory alteration process 300 loads data in a memory devicebuffer before some portion of the address information is forwarded tothe memory device.

In step 310, an indication is received to write data to a cell. It isappreciated that the indication can also be to write data to a group ofcells. In one exemplary implementation the indication to write data to acell is received in a host.

In step 320, data is stored rapidly in a buffer of the memory. In oneembodiment, the buffer is a page buffer in the memory. In one exemplaryimplementation, the buffer in the memory stores the data while a portionof a physical block address associated with the data is determined by amemory controller. For example, the controller determines the target rowaddress associated with the data while the data is stored in the bufferof the memory.

In step 330, memory cell identification or address information isdetermined. In one exemplary implementation, resolution of the differentportions of memory cell address information takes different amounts oftime. For example, determination of column address information isrelatively rapid while determination or row address information takessignificantly longer. In one embodiment, a portion of the memory celladdress information is determined after the data is stored rapidly inthe buffer of the memory.

In one exemplary implementation, a column address is determined beforethe data is stored rapidly in a buffer of the memory. For example, astarting column address for a region including a plurality of physicalblock addresses can be specified by the two least significant bits ofthe logical block address from a host, permitting the column address tobe calculated rapidly. The starting column address can also be a defaultaddress. In one embodiment, a memory controller determines a row addressof a physical block address associated with the data while the data isstored in the buffer of the memory.

In step 340, the data is written or flushed to the cell in the memoryarray. In one embodiment, the cell is unaltered if the logical state ofthe data corresponds to the static state and is programmed to a stateopposite of the static state if the data corresponds to an oppositelogical value. For example, if the static state is a logical 1 and thedata corresponds to a logical 1 the cell is left alone but if the datais a logical 0 the cell is programmed or altered to correspond to alogical 0 value.

FIG. 4 a is a block diagram of exemplary rapid buffer program sequencemethod 400 in accordance with one embodiment of the present invention.In one embodiment, rapid buffer program sequence method 400 has asequence order that is different from conventional approaches. In oneexemplary implementation of rapid buffer program sequence method 400 thecolumn address is specified prior to the data transfer and the rowaddress is issued after the data transfer. In one exemplaryimplementation, the starting column address that is specified is notaligned with the beginning of the row. FIG. 4B is a timing diagram inaccordance with one embodiment of the present invention corresponding torapid buffer program sequence method 400.

In step 410, a first program command is issued. In one embodiment, thefirst program command is a page program command or a cache programcommand. The first program command can be a load buffer command. In oneembodiment, a command latch enable (CLE) signal is asserted and thefirst program command is forwarded as an input/output (I/O) signal. Inone exemplary implementation the first program command is (80h).

In step 420, the target column address is loaded in the memory. In oneembodiment, the target column address includes column bits from thephysical block address (PBA). In one exemplary implementation, thestarting column address for a physical block address is specified by thetwo least significant bits of the logical block address (LBA) from ahost. In one exemplary implementation a command latch enable (CLE)signal is unasserted, an address latch enable (ALE) signal is assertedand column address information is forwarded as an input/output (I/O)signal.

In step 430, data is loaded into the page buffer. In one embodiment, thecommand latch enable (CLE) is unasserted, a write enable (WE) signal isasserted and data is forwarded as an input/output (I/O) signal. In oneexemplary implementation, multiple pieces of data are forwarded.

In step 440, the target row address is loaded in the memory. In oneembodiment, the target row address includes row bits from the physicalblock address (PBA). In one exemplary implementation, the write enable(WE) signal is unasserted, an address latch enable (ALE) signal isasserted and target row information is forwarded as an input/output(I/O) signal. It is appreciated that information associated withmultiple rows can be forwarded (e.g., information associated withmultiple rows corresponding to the multiple pieces of data loaded inblock 420).

In step 450, a second program command is issued to the memory. Thesecond page program command can be a page program confirm command. Inone embodiment, the second page program command initiates flushing ofthe data from the buffer of a memory into the memory array elements(e.g., memory cells, etc.). In one exemplary implementation, the pageprogram command is (10h). In one embodiment, an address latch enable(ALE) signal is unasserted, the command latch enable (CLE) signal isasserted and a page program command is forwarded as an input/output(I/O) signal.

FIG. 5A is a block diagram of exemplary rapid buffer program sequencemethod 500 in accordance with one embodiment of the present invention.Rapid buffer program sequence method 500 is similar to rapid bufferprogram sequence method 400 except a default column address is utilized.FIG. 5B is an exemplary timing diagram in accordance with one embodimentof the present invention. In another exemplary implementation, thecolumn address is specified prior to the data transfer and the rowaddress to be issued after the data transfer, the starting columnaddress is specified that is not aligned with the beginning columnaddress of the target row. For example, a first program command (e.g., aload buffer command, etc.) is issued to default to column zero, the datais loaded in to the page buffer starting at column zero, the target rowaddress is loaded, and a page program confirm command is issued.

In step 510, a first program command is issued. In one embodiment, thefirst program command is a page program command or a cache programcommand. The first program command can be a load buffer command. In oneembodiment, a command latch enable (CLE) signal is asserted and thefirst program command is forwarded as an input/output (I/O) signal. Inone exemplary implementation the first program command is (80h).

In step 520, data is loaded into the page buffer of the memory startingat column 0. In one embodiment, the command latch enable (CLE) isunasserted, a write enable (WE) signal is asserted and data is forwardedas an input/output (I/O) signal. In one exemplary implementation,multiple pieces of data are forwarded.

In step 530, the target row address (PBA) is loaded in the memory. Inone exemplary implementation, any additional column information isirrelevant or not loaded. In one embodiment, the target row addressincludes row bits from the physical block address (PBA). In oneexemplary implementation, the write enable (WE) signal is unasserted, anaddress latch enable (ALE) signal is asserted and target row informationis forwarded as an input/output (I/O) signal. It is appreciated thatinformation associated with multiple rows can be forwarded, (e.g.,information associated with multiple rows corresponding the multiplepieces of data loaded in block 420).

In step 540, a second program command is issued to the memory. Thesecond program command can be a page program confirm command. In oneembodiment, the second page program command initiates flushing of thedata from the buffer of a memory into the memory array elements (e.g.,memory cells, etc.). In one exemplary implementation, the page programcommand is (10h). In one embodiment, an address latch enable (ALE)signal is unasserted, the command latch enable (CLE) signal is assertedand a page program command is forwarded as an input/output (I/O) signal.

In one embodiment, the page program command is broken into two phases.The first phase is a data input phase and the second phase includes theactual program operation. In one embodiment a flash internal statemachine is readily adaptable to enable a variety of page programsequences. In one exemplary implementation, data is loaded in burstsinto a page buffer of the memory and loading the target row addresscorresponding to the data is at the discretion of firmware. In oneembodiment, a memory internal state machine (e.g., utilizing memorylogic 132, etc.) can enable program sequences.

FIG. 6 is a block diagram of random data input command cycle sequence600 in accordance with one embodiment of the present invention. In oneembodiment, one or more random data input command cycles are forwardedbefore a load command cycle with row address information. For example, aplurality of command cycles are executed including random data loadcommand (85h) 611, column address 612, data 613, random data loadcommand (85h) 621, column address 622, data 623, random data loadcommand (85h) 631, column address 632, data 623 all of which areforwarded to the memory device before row addresses included with afirst program command (80h) 641 (e.g., a load program command, etc),column address 642, row address 643, and program confirm command 645. Inone exemplary implementation, the memory does not care about columnaddress 642 and utilizes column address information 612, 622 and 623 orutilizes a default column address. In one embodiment a status readcommand 651 is issued and a status output 652 is forwarded.

In one embodiment, the column address is not required because there isno data entry taking place after command 80h. In one exemplaryimplementation the column address is declared “don't care”.Alternatively there is an additional data input phase (not shown) afterthe row or page address. A new command code can also be defined whichacts like 80h but skips the column address phase. In one exemplaryimplementation the new command code is used with data managementcontrollers (e.g., management command controllers that combine inputtingthe spare area data and submitting the page program command into asingle operation, etc.).

FIG. 7 is a block diagram of random data input command cycle sequence700 in accordance with one embodiment of the present invention. In oneembodiment, one or more random data input command cycles are forwardedbefore a program cache command cycle. For example, a plurality ofcommand cycles are executed including random data load command (85h)711, column address 712, data 713, random data load command (85h) 721,column address 722, and data 723 before row addresses included with loadcache command (80h) 731, row address or page address 732, data 733, andprogram confirm command 734 are forwarded to the memory device. Therecan also be a second group of random data input command cycles. Forexample, a second plurality of command cycles are executed includingrandom data load command (85h) 741, column address 742, data 743, randomdata load command (85h) 751, column address 752, and data 753 before rowaddresses included with load cache command (80h) 771, row address orpage address 772, data 773 and program confirm command 774 are forwardedto the memory device. In one exemplary implementation, the memory doesnot care about column address 732 and column address 772. In oneembodiment a status read command 751 is issued and a status output 752is forwarded.

In one embodiment, forwarding a portion of the address information afterthe data (e.g., in a different phase, in a different command cycle, etc)enables memory controller or data management controllers (e.g., securedigital (SD) or multi-media card (MMC) controllers) to eliminateexpensive internal random access memory (RAM) data buffers which wouldotherwise be required for holding data in the memory controller whilecalculating the portion of the address information (e.g., row address,page address, etc.). It is appreciated the data can be received over avariety of interfaces (e.g., universal serial bus (USB) interface,secure digital (SD) interface, multi-media card (MMC) interface, etc.).

In one exemplary implementation, firmware inside the memory controllerscalculates the row or page address to be used and also calculatescontrol data and error correction code (ECC) information (e.g. ECCinformation to be stored in the page spare area, etc.). The firmware canalso forward a program command with page+spare data to the memory device(e.g., flash device, etc.). In the present exemplary implementation, thedata received from the host can be rapidly or immediately forwarded to abuffer of the memory (e.g., memory device's data buffer, etc.) whilefirmware calculates the page address to be used and the control data andECC information. Spare area data is input into the memory device's databuffers when this calculation has finished and before the page programcommand is forwarded. In addition, the present exemplary implementationalso allows for scaling of data buffer space when multiple [OR] NANDdies are used to implement interleaved programming. Without thisextension, the controller typically has to be optimized for a particularnumber of memory dies and a particular size of page buffers within thesedies.

In one embodiment, the page data can be selectively patched with newinformation and programmed into a new location. In one exemplaryimplementation, this is similar to a “Page Duplicate Program” operation.Data management controllers often have to read a page (e.g., 2K+spare,etc.), overwrite just 512-bytes, update spare data and program the new2K+spare into a new location. In one embodiment, firmware can load thepage into the data buffer using command 00h, then submit one or multiplerandom data input commands (85h) and program the new page contents usingcommand 80h. In addition, repeating page contents (e.g., same page+sparecontents to be programmed into multiple pages, etc.) can be moreefficiently programmed because the data pattern is input once and can beprogrammed multiple times.

Thus, the present invention facilitates efficient and effectiveinformation storage. The present invention enables reduction of bufferresources in a memory controller. Elimination of the buffer in thememory controller can result in a reduced controller died size. Inaddition, the elimination of the buffer in the memory controller canalso improve overall system performance because data transfer flowsrapidly from the host to the memory device without being stored in thememory controller for determination of the complete address information.

The foregoing descriptions of specific embodiments of the presentinvention have been presented for purposes of illustration anddescription. They are not intended to be exhaustive or to limit theinvention to the precise forms disclosed, and obviously manymodifications and variations are possible in light of the aboveteaching. The embodiments were chosen and described in order to bestexplain the principles of the invention and its practical application,to thereby enable others skilled in the art to best utilize theinvention and various embodiments with various modifications as aresuited to the particular use contemplated. It is intended that the scopeof the invention be defined by the Claims appended hereto and theirequivalents.

What is claimed is:
 1. A memory write method comprising: issuing a firstprogram command to a memory; loading data into a buffer of said memory;breaking page program commands into phases in which a data input commandcycle is forwarded before a load command cycle with row addressinformation; and issuing a program confirm command.
 2. A memory writemethod of claim 1 wherein a column address is specified prior to loadingof the data.
 3. A memory write method of claim 1 wherein the targetcolumn address includes column bits from the physical block address(PBA).
 4. A memory write method of claim 1 wherein the target columnaddress is declared don't care.
 5. A memory write method of claim 1wherein a starting column address is specified that is not aligned withthe beginning of the row.
 6. A memory write method of claim 1 whereinbursts of loading data into said buffer of said memory and loading thetarget row address corresponding to the data is at the discretion offirmware.
 7. A memory write method of claim 1 wherein said buffer is apage buffer included in said memory.
 8. A memory system comprising: ahost for processing information; a memory for storing said information,including a memory array for storing information and a buffer fortemporarily storing information before the information is forwarded tothe memory array; and a memory controller for controlling communicationof said information between said host and said memory, wherein saidmemory control routes data rapidly to the buffer of said memory withoutbuffering in said memory controller during the complete determination ofcorresponding address information, wherein one or more random data inputcommand cycles are forwarded before a program cache command cycle.
 9. Amemory system of claim 8 wherein said buffer is a page buffer in saidmemory.
 10. A memory system of claim 8 wherein said host performs arapid memory page buffer write operation with a reordered sequence inwhich a column address is specified prior to the data transfer and a rowaddress is issued after the data transfer.
 11. A memory system of claim8 wherein the memory accepts additional information, including sparedata.
 12. A memory system of claim 8 wherein the buffer is scalable. 13.A memory system of claim 8 including interleaved programming.
 14. Amemory alteration method comprising: receiving an indication to writedata to a cell; storing data and a first portion of memory cell addressinformation rapidly in a buffer of the memory, wherein the first portionof said memory cell address information is determined before the data isstored in the buffer; and determining memory cell identification oraddress information, wherein a portion of the memory cell addressinformation is determined while the data is stored in the buffer of thememory.
 15. A memory alteration method of claim 14 wherein the data isselectively patched with new information.
 16. A memory alteration methodof claim 15 wherein the data patched with the new information isprogrammed into a new location.
 17. A memory alteration method of claim14 wherein the data rapidly includes spare data.
 18. A memory alterationmethod of claim 14 wherein a data pattern is input once and programmedmultiple times.
 19. A memory alteration method of claim 14 wherein thefirst portion of the memory cell address information and control data isdetermined while the data is stored in the buffer of the memory.
 20. Amemory alteration method of claim 14 wherein ECC information isdetermined while the data is stored in the buffer of the memory.